Coreduction homology algorithm for inclusions and persistent homology
نویسندگان
چکیده
منابع مشابه
Coreduction homology algorithm for inclusions and persistent homology
We present an algorithm for computing the homology of inclusion maps which is based on the idea of coreductions and leads to significant speed improvements over current algorithms. It is shown that this algorithm can be extended to compute both persistent homology and an extension of the persistence concept to two-sided filtrations. In addition to describing the theoretical background, we prese...
متن کاملCoreduction Homology Algorithm
A new reduction algorithm for the efficient computation of the homology of cubical sets and polotypes, particularly strong for low dimensional sets embedded in high dimensions, is presented. The algorithm runs in linear time. The paper presents the theoretical background of the algorithm, the algorithm itself, experimental results based on an implementation for cubical sets as well as some theo...
متن کاملCoreduction Homology Algorithm for Regular CW-Complexes
In this paper we present a new algorithm for computing the homology of regular CW-complexes. This algorithm is based on the coreduction algorithm due to Mrozek and Batko and consists essentially of a geometric preprocessing algorithm for the standard chain complex generated by a CW-complex. By employing the concept of S-complexes the original chain complex can — in all known practical cases — b...
متن کاملIncremental-Decremental Algorithm for Computing AT-Models and Persistent Homology
In this paper, we establish a correspondence between the incremental algorithm for computing AT-models [8,9] and the one for computing persistent homology [6,14,15]. We also present a decremental algorithm for computing AT-models that allows to extend the persistence computation to a wider setting. Finally, we show how to combine incremental and decremental techniques for persistent homology co...
متن کاملBarcodes of Towers and a Streaming Algorithm for Persistent Homology
A tower is a sequence of simplicial complexes connected by simplicial maps. We show how to compute a filtration, a sequence of nested simplicial complexes, with the same persistent barcode as the tower. Our approach is based on the coning strategy by Dey et al. (SoCG 2014). We show that a variant of this approach yields a filtration that is asymptotically only marginally larger than the tower a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.09.036